Application-Aware Resource Management in Wireless and Visual Sensor Networks
نویسندگان
چکیده
Wireless Sensor Networks continue to gain tremendous popularity, as evidenced by the increasing number of applications for these networks. The limiting factors of the sensor nodes, such as their finite energy supplies and their moderate processing abilities, as well as the unreliable wireless medium restrict the performance of wireless sensor networks. In this dissertation, we explore application-aware techniques for managing the limited resources available to wireless sensor networks, focusing on ways to maximize the network lifetime for clustered sensor networks and visual sensor networks. We begin by focusing on a hierarchical cluster-based sensor network architecture, which reduces the network’s need for resources through data aggregation and a reduction of the communication overhead. In order to provide balanced energy consumption in clustered sensor networks, we introduce novel methods for network organization based on unequal size clusters, as opposed to the generally accepted equal-size clustering approach. In sensor networks that are constrained by coverage-preserving requirements we explore the use of application-aware (i.e., coverage-aware) metrics for cluster head, router, and active node role assignment. We believe that the real potential of wireless sensor networks lies in their integration with various sensing technologies and research disciplines, which will trigger widespread use of sensor networks in a number of specific applications. Thus, we adopt these ideas of application-aware resource allocation specifically for visual sensor networks. The higher demands for the network’s resources, the tighter QoS requirements, and the unique camera sensing capabilities are the main reasons why these types of networks are different and more challenging than existing (“traditional”) sensor networks. We examine the impact of camera-specific sensing characteristics on the network’s behavior in the case when a routing pro-
منابع مشابه
An efficient symmetric polynomial-based key establishment protocol for wireless sensor networks
An essential requirement for providing secure services in wireless sensor networks is the ability to establish pairwise keys among sensors. Due to resource constraints on the sensors, the key establishment scheme should not create significant overhead. To date, several key establishment schemes have been proposed. Some of these have appropriate connectivity and resistance against key exposure, ...
متن کاملENERGY AWARE DISTRIBUTED PARTITIONING DETECTION AND CONNECTIVITY RESTORATION ALGORITHM IN WIRELESS SENSOR NETWORKS
Mobile sensor networks rely heavily on inter-sensor connectivity for collection of data. Nodes in these networks monitor different regions of an area of interest and collectively present a global overview of some monitored activities or phenomena. A failure of a sensor leads to loss of connectivity and may cause partitioning of the network into disjoint segments. A number of approaches have be...
متن کاملA JOINT DUTY CYCLE SCHEDULING AND ENERGY AWARE ROUTING APPROACH BASED ON EVOLUTIONARY GAME FOR WIRELESS SENSOR NETWORKS
Network throughput and energy conservation are two conflicting important performance metrics for wireless sensor networks. Since these two objectives are in conflict with each other, it is difficult to achieve them simultaneously. In this paper, a joint duty cycle scheduling and energy aware routing approach is proposed based on evolutionary game theory which is called DREG. Making a trade-off ...
متن کاملEIDA: An Energy-Intrusion aware Data Aggregation Technique for Wireless Sensor Networks
Energy consumption is considered as a critical issue in wireless sensor networks (WSNs). Batteries of sensor nodes have limited power supply which in turn limits services and applications that can be supported by them. An efcient solution to improve energy consumption and even trafc in WSNs is Data Aggregation (DA) that can reduce the number of transmissions. Two main challenges for DA are: (i)...
متن کاملLPKP: location-based probabilistic key pre-distribution scheme for large-scale wireless sensor networks using graph coloring
Communication security of wireless sensor networks is achieved using cryptographic keys assigned to the nodes. Due to resource constraints in such networks, random key pre-distribution schemes are of high interest. Although in most of these schemes no location information is considered, there are scenarios that location information can be obtained by nodes after their deployment. In this paper,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008